SOLVING A PERIODIC CAPACITATED VEHICLE ROUTING PROBLEM USING SIMULATED ANNEALING ALGORITHM FOR A MANUFACTURING COMPANY
نویسندگان
چکیده
منابع مشابه
Solving a robust capacitated arc routing problem using a hybrid simulated annealing algorithm: A waste collection application
The urban waste collection is one of the major municipal activities that involves large expenditures and difficult operational problems. Also, waste collection and disposal have high expenses such as investment cost (i.e. vehicles fleet) and high operational cost (i.e. fuel, maintenance). In fact, making slight improvements in this issue lead to a huge saving in municipal consumption. Some inci...
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملsolving a robust capacitated arc routing problem using a hybrid simulated annealing algorithm: a waste collection application
the urban waste collection is one of the major municipal activities that involves large expenditures and difficult operational problems. also, waste collection and disposal have high expenses such as investment cost (i.e. vehicles fleet) and high operational cost (i.e. fuel, maintenance). in fact, making slight improvements in this issue lead to a huge saving in municipal consumption. some inci...
متن کاملA simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints
The Capacitated Vehicle Routing Problem (CVRP) is a combinatorial optimization problem where a fleet of delivery vehicles must service known customer demands from a common depot at a minimum transit cost without exceeding the capacity constraint of each vehicle. In this paper, we present a meta-heuristic approach for solving the CVRP based on simulated annealing. The algorithm uses a combinatio...
متن کاملFuzzy Clustering for Initialization of Simulated Annealing Algorithm to Solve a Capacitated Vehicle Routing Problem
Vehicle Routing Problem (VRP) has been an interesting research area since its introduction. There are various types of VRP models and different solution techniques proposed for this problem. This paper uses several clustering algorithms in initialization of Simulated Annealing to solve VRP. The main contribution of this research is to assess the effect of using some clustering methods in buildi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Brazilian Journal of Operations & Production Management
سال: 2020
ISSN: 2237-8960,1679-8171
DOI: 10.14488/bjopm.2020.011